The dynamic ‘expectation–conditional maximization either’ algorithm
نویسندگان
چکیده
The ‘expectation–conditional maximization either’ (ECME) algorithm has proven to be an effective way of accelerating the expectation–maximization algorithm for many problems. Recognizing the limitation of using prefixed acceleration subspaces in the ECME algorithm, we propose a dynamic ECME (DECME) algorithm which allows the acceleration subspaces to be chosen dynamically. The simplest DECME implementation is what we call DECME-1, which uses the line that is determined by the two most recent estimates as the acceleration subspace. The investigation of DECME-1 leads to an efficient, simple, stable and widely applicable DECME implementation, which uses two-dimensional acceleration subspaces and is referred to as DECME-2. The fast convergence of DECME-2 is established by the theoretical result that, in a small neighbourhood of the maximum likelihood estimate, it is equivalent to a conjugate direction method. The remarkable accelerating effect of DECME-2 and its variant is also demonstrated with several numerical examples.
منابع مشابه
An Explanation of the Expectation Maximization Algorithm, Report no. LiTH-ISY-R-2915
The expectation maximization (EM) algorithm computes maximum likelihood estimates of unknown parameters in probabilistic models involving latent variables. More pragmatically speaking, the EM algorithm is an iterative method that alternates between computing a conditional expectation and solving a maximization problem, hence the name expectation maximization. We will in this work derive the EM ...
متن کاملMaximum Conditional Likelihood via Bound Maximization and the CEM Algorithm
We present the CEM (Conditional Expectation Maximization) algorithm as an extension of the EM (Expectation Maximization) algorithm to conditional density estimation under missing data. A bounding and maximization process is given to speci cally optimize conditional likelihood instead of the usual joint likelihood. We apply the method to conditioned mixture models and use bounding techniques to ...
متن کاملMaximum Conditional Likelihood
We present the CEM (Conditional Expectation Maximization) algorithm as an extension of the EM (Expectation Maximization) algorithm to conditional density estimation under missing data. A bounding and maximization process is given to speciically optimize conditional likelihood instead of the usual joint likelihood. We apply the method to conditioned mixture models and use bounding techniques to ...
متن کاملSegmental Hidden Markov Models with Random Effects for Waveform Modeling
This paper proposes a general probabilistic framework for shape-based modeling and classification of waveform data. A segmental hidden Markov model (HMM) is used to characterize waveform shape and shape variation is captured by adding random effects to the segmental model. The resulting probabilistic framework provides a basis for learning of waveform models from data as well as parsing and rec...
متن کاملComputational Methods for Multiple Level Linear Mixed-effects Models
In an earlier paper we provided easily-calculated expressions for the gradient of the profiled log-likelihood and log-restricted-likelihood for single-level mixed-effects models. We also showed how this gradient is related to the update of an ECME (expectation conditional maximization either) algorithm for such single level models. In this paper we extend those results to mixed-effects models w...
متن کامل